On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem

نویسنده

  • M. M. Chowdhury
چکیده

At the CRYPTO 2000 conference the seminal KLCHKP (Ko-Lee-CheonHan-Kang-Park) braid group public-key cryptosystem was published see [2]. An updated version of the KLCHKP cryptosystem which is the CKLHC (ChaKo-Lee-Han-Cheon) braid group cryptosystem was introduced at ASIACRYPT 2001 conference [10] the claim of the authors was the updated cryptosystem is based on the DH-DP (Diffie-Hellman Decomposition Problem). We show that the KLCHKP and CKLHC cryptosystems are based on the MSCSP and it has been assumed for several years the security of these cryptosystems are based on the DH-CP and DH-DP respectively, we also show the related cryptosystems may be based on the MSCSP and hence give a new way to break the KLCHKP and CKLHC cryptosystems and the related cryptosystems for some parameters. It has been shown there is a linear algebraic attack on the KLCHKP and CKLHC cryptosystems but our attack is more practical.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Public-Key Cryptosystem Using Braid Groups

The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups can serve as a good source to enrich cryptography. The feature that makes the braid groups useful to cryptography includes the followings: (i) The word problem is solved via a fast algorithm which computes the canonical form which...

متن کامل

Towards generating secure keys for braid cryptography

Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this paper, we first survey all the major attacks on the braid cryptosystem and conclude that the ...

متن کامل

An Efficient Implementation of Braid Groups

We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual implementation under various choices of parameters is listed.

متن کامل

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0708.2571  شماره 

صفحات  -

تاریخ انتشار 2007